TAG's as a Grammatical Formalism for Generation

نویسندگان

  • David D. McDonald
  • James Pustejovsky
چکیده

Tree Adj~g Grammars, or "TAG's', (Josh/, Levy & Takahash/ 1975; Josh/ 1983; Kroch & Josh/ 1965) we~ developed as an al~ma~ive to the aandard tyntac~ formalisms that are ,,_~'~ in theoretical ~,.ll,/~s of languaSe. They are a.rwac~ve because they may pin,vide just the asFects of context seusit~ve exptes~e Fmv~r that actually appear in human lanSuages while otherwise r ~ a l n i n g context free. "['n/s paper ___~,~,ibcs how we have applied the theory of Tree Adjoining Grammars to natural language generation. We have ~ attracted to TAG's because their cemral opemtiou--~he exteamou of an "initial" phra~ m~ca~u tree through the incl~/ou, at re,? , ~ y came~/aed loeatinus, of oae or mmu "au~!!iar~'* ~ d s dixec~ to cextain ceat~ ol~rat~m of our owu, p~rfonnnce-one~ted theory. We besm by briefly _,~,,-,ibin 8 TAG's u • formalism for phrase ram:rare in a com~___~ theory, and summar/ze the points in the theory of TAG's that are germainu to our own theory. We them conmdm' generaUy the poation of a grammar within the geueratiem process, inemducmg our use of TAG's through a contrast with how oth~nJ have used system~ grammars. This takes us to the ,~,~,~ resulm of our psper:, usng eaamp/es from our research with wefl.wrR1eu trots from aewupapmm, we walk throush our TAG insp/~ed treatments cl r ~ n g and wh-movemem, and show the cc~denc~ of the T A G ~adjunct/oo" oper~t/oa and our "attachment" process. In the final tectiou we discuss ~mau/ons to the theory, motivated by the way we usa the operafiou cmveqxmdin 8 to TAG's" adjun~iou in performance. This mssesss that the compe~eace theory of TAG' s can be profitably projoc~ed to s~na:tur~ at the morphoiogicaJ leve/ as weft as the preseat syntacuc level 2. Tree Ad]unctioo Grammars

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some Computational Properties of tree Adjoining Grammars

Tree Adjoining Grammar (TAG) is u formalism for natural language grammars. Some of the basic notions of TAG's were introduced in [Jo~hi,Levy, mad Takakashi I~'Sl and by [Jo~hi, l ~ l . A detailed investigation of the linguistic relevance of TAG's has been carried out in IKroch and Joshi,1985~. In this paper, we will describe some new results for TAG's, espe¢ially in the following areas: (I) par...

متن کامل

I Introduction

In natural language generation the grammatical component has to be systematically interfaced to the other components of the system, for example, the planning component. Grammatical formalisms can be studied with respect to their suitability for generation. The tree adjoining grammar (TAG) formalism has been previously studied in terms of incremental generation. In this paper, the TAG formalism ...

متن کامل

C-Command and Extraction in Tree Adjoining Grammar

A number of problems for the Tree Adjoining Grammar (TAG) formalism have been identi-ed in the literature. In this paper we argue for a reconceptualization of the TAG formalism, in which the elementary structures are collections of c-command relations, and the combina-tory operation is substitution. We demonstrate how the formalism we sketch, though similar in certain respects to D-tree grammar...

متن کامل

Information-based Case Grammar

In this paper we propose a framework of Informationbased Case Grammar (ICG). This grammatical formalism entails that the lexical entry for each word contain both semantic and syntactic feature structures. In the feature structure of a phrasal head, we encode syntactic and semantic constraints on grammatical phrasal patterns in terms of thematic structures, and encode the precedence relations in...

متن کامل

Rhetorical Goals Surface Generator Functional Realizer Functional Description

In recent years, natural language generation research has begun to mature rapidly. It has witnessed both the appearance of sophisticated oo-the-shelf surface realizations systems and the development in the knowledge representation community of knowledge bases in a variety of domains. However, knowledge bases typically employ a logic formalism while the state-of-the-art surface realizer, Fuf, em...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1985